Multistep matrix splitting iteration preconditioning for singular linear systems
نویسندگان
چکیده
منابع مشابه
Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملSingular constrained linear systems
In the linear system Ax = b the points x are sometimes constrained to lie in a given subspace S of column space of A. Drazin inverse for any singular or nonsingular matrix, exist and is unique. In this paper, the singular consistent or inconsistent constrained linear systems are introduced and the effect of Drazin inverse in solving such systems is investigated. Constrained linear system arise ...
متن کاملOn the Numerical Behavior of Matrix Splitting Iteration Methods for Solving Linear Systems
We study the numerical behavior of stationary one-step or two-step matrix splitting iteration methods for solving large sparse systems of linear equations. We show that inexact solutions of inner linear systems associated with the matrix splittings may considerably influence the accuracy of the approximate solutions computed in finite precision arithmetic. For a general stationary matrix splitt...
متن کاملGeneral constraint preconditioning iteration method for singular saddle-point problems
For the singular saddle-point problems with nonsymmetric positive definite (1, 1) block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the Moore-Penrose inverse, the convergence properties of the GCP iteration method are studied. In particular, for each of the two different choices of the (1, 1) bloc...
متن کاملcomparison results on the preconditioned mixed-type splitting iterative method for m-matrix linear systems
consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2017
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-017-0330-0